On nested completely regular codes and distance regular graphs
نویسنده
چکیده
Infinite families of linear binary nested completely regular codes with covering radius ρ equal to 3 and 4 are constructed. In the usual way, i.e., as coset graphs, infinite families of embedded distance-regular coset graphs of diameter D = 3 or 4 are constructed. In some cases, the constructed codes are also completely transitive codes and the corresponding coset graphs are distance-transitive.
منابع مشابه
Families of nested completely regular codes and distance-regular graphs
In this paper infinite families of linear binary nested completely regular codes are constructed. They have covering radius ρ equal to 3 or 4, and are 1/2-th parts, for i ∈ {1, . . . , u} of binary (respectively, extended binary) Hamming codes of length n = 2 − 1 (respectively, 2), where m = 2u. In the usual way, i.e., as coset graphs, infinite families of embedded distance-regular coset graphs...
متن کاملArithmetic completely regular codes
In this paper, we explore completely regular codes in the Hamming graphs and related graphs. Experimental evidence suggests that many completely regular codes have the property that the eigenvalues of the code are in arithmetic progression. In order to better understand these “arithmetic completely regular codes”, we focus on cartesian products of completely regular codes and products of their ...
متن کاملClassification of a class of distance-regular graphs via completely regular codes
The study of P-polynomial association schemes, or distance-regular graphs, and their possible classification is one of the main topics of algebraic combinatorics. One way to approach the issue is through the parameters Pkij which characterize the scheme. The purpose of this paper is to deal with a concrete case. This case is also important in the study of the links between P-polynomial schemes ...
متن کاملSome Families of Orthogonal Polynomials of a Discrete Variable and their Applications to Graphs and Codes
We present some related families of orthogonal polynomials of a discrete variable and survey some of their applications in the study of (distance-regular) graphs and (completely regular) codes. One of the main peculiarities of such orthogonal systems is their non-standard normalization condition, requiring that the square norm of each polynomial must equal its value at a given point of the mesh...
متن کاملCompletely regular codes – a viewpoint and some problems
Since their introduction in 1973, completely regular codes have been of interest to coding theorists and graph theorists alike. These highly regular substructures were defined as a generalization of perfect and uniformly packed error-correcting codes but also include many codes having very small minimum distance which are fundamental to the study of distance-regular graphs. While interest in th...
متن کامل